Pentagons: A weakly relational abstract domain for the efficient validation of array accesses

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weakly Relational Numerical Abstract Domains

Interpretation Abstract Interpretation: General theory of sound approximations of semantics [Cousot78]. Numerical Abstract Domain: • computer-representable set D of abstract values, together with: • a concretisation: γ: D → P(V → I), • a partial order: ⊑, ⊥, ⊤, • sound, effective abstract transfer functions {| I |}: ({| I |} ◦ γ)(X ) ⊆ (γ ◦ {| I |})(X ), a sound, effective abstract union ∪: γ(X...

متن کامل

A Relational Shape Abstract Domain

Static analyses aim at inferring semantic properties of programs. While many analyses compute an over-approximation of reachable states, some analyses compute a description of the input-output relations of programs. In the case of numeric programs, several analyses have been proposed that utilize relational numerical abstract domains to describe relations. On the other hand, designing abstracti...

متن کامل

Logahedra: A New Weakly Relational Domain

Weakly relational numeric domains express restricted classes of linear inequalities that strike a balance between what can be described and what can be efficiently computed. Popular weakly relational domains such as bounded differences and octagons have found application in model checking and abstract interpretation. This paper introduces logahedra, which are more expressiveness than octagons, ...

متن کامل

Widening Operators for Weakly-Relational Numeric Abstractions (Extended Abstract)

In recent years there has been a lot of interest in the definition of so-called weakly-relational numeric domains, whose complexity and precision are in between the (non-relational) abstract domain of intervals [9] and the (relational) abstract domain of convex polyhedra [10]. The first weakly-relational domain proposed in the literature is based on systems of constraints of the form x−y ≤ c an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 2010

ISSN: 0167-6423

DOI: 10.1016/j.scico.2009.04.004